A Novel Penalty Scheme in Genetic Algorithms For Structural Design Optimization
نویسندگان
چکیده
منابع مشابه
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is adaptively computed along the run according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. Using real coding, rank-base...
متن کاملGenetic Algorithms for Structural Cluster Optimization
Certain aspects of the methodology of genetic algorithms for global structural optimization of clusters were studied. Through systematic investigations of Lennard-Jones clusters with up to 100 atoms, several modifications were made to the genetic algorithm introduced by Deaven and Ho [Phys. ReV. Lett. 1995, 75, 288]. These modifications result in improved efficiency of the search procedure and ...
متن کاملPenalty Guided Genetic Search for Reliability Design Optimization
Reliability optimization has been studied in the literature for decades, usually using a mathematical programming approach. Because of these solution methodologies, restrictions on the type of allowable design have been made, however heuristic optimization approaches are free of such binding restrictions. One difficulty in applying heuristic approaches to reliability design is the highly constr...
متن کاملThe Multidisciplinary Design Optimization of a Reentry Vehicle Using Parallel Genetic Algorithms
The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...
متن کاملPenalty Functions for Genetic Programming Algorithms
Very often symbolic regression, as addressed in Genetic Programming (GP), is equivalent to approximate interpolation. This means that, in general, GP algorithms try to fit the sample as better as possible but no notion of generalization error is considered. As a consequence, overfitting, code-bloat and noisy data are problems which are not satisfactorily solved under this approach. Motivated by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ASEAN Journal on Science and Technology for Development
سال: 2000
ISSN: 2224-9028,0217-5460
DOI: 10.29037/ajstd.109